Concurrency Made Easy
نویسنده
چکیده
It includes both the Extended Synopsis (pages 5 to 9) and the full scientific proposal (pages 10 to 25). The 5-page description of the Principal Investigator's background (CV, awards etc.) has been removed, as well as the detailed budget table. The contribution of Sebastian Nanz to the preparation of the project is gratefully acknowledged, as well as the help of Carlo Furia and Claudia Günthart. The information presented here is public and is copyright Bertrand Meyer, 2011. If you have any question on the project please feel free to contact Prof. Meyer.
منابع مشابه
A Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملAn occam-pi Implementation of a Verified Distributed Robust Annealing Algorithm
Significant additions have recently been made to the occam concurrent programming language. The new occam-π now supports, among other features, mobile channels, mobile processes, shared channels, and dynamic forking of new concurrent processes. These features should greatly enhance the ability of occam to precisely and easily implement complex concurrent applications. We have recently evaluated...
متن کاملAn occam-π Implementation of a Distributed Robust Annealing Algorithm
Significant additions have recently been made to the occam concurrent programming language. The new occam-π now supports, among other features, mobile channels, mobile processes, shared channels, and dynamic forking of new concurrent processes at run-time. These features should greatly enhance the ability of occam to precisely and easily implement complex concurrent applications. We have recent...
متن کاملSCOOP: Concurrent Programming Made Easy
The SCOOP model (Simple Concurrent Object-Oriented Programming) provides a simple yet very powerful mechanism for parallel computation. The model takes advantage of the inherent concurrency implicit in object-oriented programming to provide programmers with a simple extension enabling them to produce parallel applications with little more effort than sequential ones. SCOOP is applicable to many...
متن کاملPrioritised dynamic communicating and mobile processes
Continuing research on language design, compilation and kernel support for highly dynamic concurrent reactive systems is reported. The work extends the occam multiprocessing language, which is both sufficiently small to allow for easy experimentation and sufficiently powerful to yield results that are directly applicable to a wide range of industrial and commercial practice. Classical occam was...
متن کامل